Inflated graphs with equal independence number and upper irredundance number
نویسندگان
چکیده
منابع مشابه
On Stability Number of Upper Irredundance Number in Graphs
A vertex v in a vertex-subset I of an undirected graph G is said to be redundant if its closed neighborhood is contained in the union of closed neighborhoods of vertices of I − {v}. In the context of a communication network , this means that any vertex that may receive communications from I may also be informed from I − {v} . The irredundance number ir(G) is the minimum cardinality taken over a...
متن کاملIndependence, irredundance, degrees and chromatic number in graphs
Let (G) and IR(G) denote the independence number and the upper irredundance number of a graph G. We prove that in any graph of order n, minimum degree and maximum degree =0, IR(G)6 n=(1 + = ) and IR(G) − (G)6 (( − 2)=2 )n. The two bounds are attained by arbitrarily large graphs. The second one proves a conjecture by Rautenbach related to the case = 3. When the chromatic number of G is less than...
متن کاملUpper domination and upper irredundance perfect graphs
Let β(G), Γ(G) and IR(G) be the independence number, the upper domination number and the upper irredundance number, respectively. A graph G is called Γperfect if β(H) = Γ(H), for every induced subgraph H of G. A graph G is called IR-perfect if Γ(H) = IR(H), for every induced subgraph H of G. In this paper, we present a characterization of Γ-perfect graphs in terms of some family of forbidden in...
متن کاملClasses of Graphs for Which Upper Fractional Domination Equals Independence, Upper Domination, and upper Irredundance
This paper investigates cases where one graph parameter, upper fractional domination, is equal to three others: independence, upper domination and upper irredundance. We show that they are all equal for a large subclass, known as strongly perfect graphs, of the class of perfect graphs. They are also equal for odd cycles and upper bound graphs. However for simplicial graphs, upper irredundance m...
متن کاملNew results on upper domatic number of graphs
For a graph $G = (V, E)$, a partition $pi = {V_1,$ $V_2,$ $ldots,$ $V_k}$ of the vertex set $V$ is an textit{upper domatic partition} if $V_i$ dominates $V_j$ or $V_j$ dominates $V_i$ or both for every $V_i, V_j in pi$, whenever $i neq j$. The textit{upper domatic number} $D(G)$ is the maximum order of an upper domatic partition. We study the properties of upper domatic number and propose an up...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2001
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00433-7